Approximating Weak Bisimulation on Basic Process Algebras
نویسنده
چکیده
Themaximal strong andweak bisimulations on any class of processes can be obtained as the limits of decreasing chains of binary relations, approximants. In the case of strong bisimulation and Basic Process Algebras this chain has length at most !which enables semidecidability of strong bisimilarity. We show that it is not so for weak bisimulation where the chain can grow much longer, and discuss the implications this has for the problem of (semi)decidability of weak bisimilarity.
منابع مشابه
Refining the Undecidability Border of Weak Bisimilarity
Weak bisimilarity is one of the most studied behavioural equivalences. This equivalence is undecidable for pushdown processes (PDA), process algebras (PA), and multiset automata (MSA, also known as parallel pushdown processes, PPDA). Its decidability is an open question for basic process algebras (BPA) and basic parallel processes (BPP). We move the undecidability border towards these classes b...
متن کاملApproximating Labelled Markov Processes Again!
Labelled Markov processes are continuous-state fully probabilistic labelled transition systems. They can be seen as co-algebras of a suitable monad on the category of measurable space. The theory as developed so far included a treatment of bisimulation, logical characterization of bisimulation, weak bisimulation, metrics, universal domains for LMPs and approximations. Much of the theory involve...
متن کاملHighly Undecidable Questions for Process Algebras
We show Σ 1-completeness of weak bisimilarity for PA (process algebra), and of weak simulation preorder/equivalence for PDA (pushdown automata), PA and PN (Petri nets). We also show Π 1 hardness of weak ω-trace equivalence for the (sub)classes BPA (basic process algebra) and BPP (basic parallel processes).
متن کاملTowards Performance Evaluation in Process Algebras
A new bisimulation based semantics, called performance equivalence, is proposed for a finite process algebra. It equates systems whenever they perform the same actions in the same amount of time, thus introducing a simple form of performance evaluation in process algebras. A comparison with other equivalences is provided; in particular, we show that performance equivalence is strictly finer tha...
متن کاملGlobal Timed Bisimulation: An Introduction
Bisimulations are a broadly used formalism to deene the semantics of process algebras. In particular, by means of weak bisimulation most of the internal activity of processes may be abstracted. Unfortunately, this is not fully accomplished: for instance, the internal choice operator becomes non-associative since bisimulation can see the branching structure of processes. In this paper we propose...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999